Thread-Modular Counterexample-Guided Abstraction Refinement
نویسندگان
چکیده
We consider the refinement of a static analysis method called thread-modular verification. It was an open question whether such a refinement can be done automatically. We present a counterexampleguided abstraction refinement algorithm for thread-modular verification and demonstrate its potential, both theoretically and practically.
منابع مشابه
Modular Counterexample Guided Abstraction Refinement for Temporal-Epistemic Logic
We introduce a fully automatic technique for the modular abstraction refinement of multi-agent systems with respect to a formula in the universal fragment of the temporal-epistemic CTLK. Unlike previous approaches to temporal-epistemic abstraction refinement, our procedure is modular and works at the local component level. Consequently, the validation of counterexamples and the refinement of qu...
متن کاملAbstraction Refinement for Termination
ion Refinement for Termination⋆ Byron Cook, Andreas Podelski, and Andrey Rybalchenko 1 Microsoft Research, Cambridge 2 Max-Planck-Institut für Informatik, Saarbrücken Abstract. Abstraction can often lead to spurious counterexamples. Counterexample-guided abstraction refinement is a method of strengthening abstractions based on the analysis of these spurious counterexamples. For invariance prope...
متن کاملCounterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems
Graph transformation systems are a general specification language for systems with dynamically changing topologies, such as mobile and distributed systems. Although in the last few years several analysis and verification methods have been proposed for graph transformation systems, counterexample-guided abstraction refinement has not yet been studied in this setting. We propose a counterexample-...
متن کاملThe Localization Reduction and Counterexample-Guided Abstraction Refinement
Automated abstraction is widely recognized as a key method for computer-aided verification of hardware and software. In this paper, we describe the evolution of counterexample-guided refinement and other iterative abstraction refinement techniques.
متن کاملCounterexample Guided Abstraction Refinement for Stability Analysis
In this paper, we present a counterexample guided abstraction refinement (Cegar) algorithm for stability analysis of polyhedral hybrid systems. Our results build upon a quantitative predicate abstraction and model-checking algorithm for stability analysis, which returns a counterexample indicating a potential reason for instability. The main contributions of this paper include the validation of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010